What is a Model of the Lambda Calculus?
نویسنده
چکیده
An elementary, purely algebraic definition of model for the untyped lambda calculus is given. This definition is shown to be equivalent to the natural semantic definition based on environments. These definitions of model are consistent with, and yield a completeness theorem for, the standard axioms for lambda convertibility. A simple construction of models for lambda calculus is reviewed. The algebraic formulation clarifies the relation between combinators and lambda terms.
منابع مشابه
A Nonlinear Creep-damage Constitutive Model of Mudstone Based on the Fractional Calculus Theory
During the flood development in an oil field, the creep characteristic of mudstone is one of the important factors causing casing damage. In this study, based on the theory of fractional order differential and taking into account the creep damage evolution rules, a fractional nonlinear creep-damage model is proposed to reflect the instantaneous deformation in loading processes and the accelerat...
متن کاملHigh-level Concurrent Languages
ing Communications in Mobile Processes Vasco T. Vasconcelos, University of Lisbon Witnessing the increase of complexity on the objects that names may carry in process algebras — from CCS, through the (monadic and then the polyadic) picalculus, to the calculus of objects (where names carry a label together with a tuple of names) — we propose a framework where communications are taken from an abs...
متن کاملA Weakly - Typed Higher Order Logicwith
We deene a higher order logic which has only a weak notion of type, and which permits all terms of the untyped lambda calculus and allows the use of the Y combinator in writing recursive predicates. The consistency of the logic is maintained by a distinction between use and mention, as in Gilmore's logics. We give a consistent model theory and a proof system which is valid with respect to the m...
متن کاملOn the denotational semantics of the untyped lambda-mu calculus
Starting with the idea of reflexive objects in Selinger’s control categories, we define three different denotational models of Parigot’s untyped lambda-mu calculus. The first one is built from an intersection types system for the lambda-mu calculus leading to a generalization of Engeler’s model of the untyped lambda calculus. The second model introduces correlation spaces (coming from Girard’s ...
متن کاملA theory of program refinement
We give a canonical program refinement calculus based on the lambda calculus and classical first-order predicate logic, and study its proof theory and semantics. The intention is to construct a metalanguage for refinement in which basic principles of program development can be studied. The idea is that it should be possible to induce a refinement calculus in a generic manner from a programming ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Information and Control
دوره 52 شماره
صفحات -
تاریخ انتشار 1982